Relating ways to instantiate abstract argumentation frameworks
نویسنده
چکیده
This paper studies the relation between various ways to instantiate Dung’s abstract argumentation frameworks. First the ASPIC framework, which explicitly generates abstract argumentation frameworks, is equivalently reformulated in terms of John Pollock’s recursive labelling method, which does not explicitly generate such frameworks. The reformulation arguably facilitates more natural explanations of dialectical argument evaluation. Then a variant is examined of a recent proposal by Wyner, Bench-Capon and Dunne to instantiate abstract argumentation frameworks without defining explicit inferential relations between arguments. The proposal is reformulated in a way that is equivalent to ASPIC under some limiting assumptions. The proof exploits the equivalence between ASPIC and Pollock’s recursive labellings proven in the first part of the paper.
منابع مشابه
Relating Concrete Argumentation Formalisms and Abstract Argumentation
There are a wide variety of formalisms for defeasible reasoning that can be seen as implementing concrete argumentation on defeasible rules. However there has been little work on the relationship between such languages and Dung’s abstract argumentation. In this paper we identify two small fragments on which many concrete defeasible formalisms agree. The two fragments are closely related, as we ...
متن کاملAbstract Rule-Based Argumentation
Rule-Based Argumentation Sanjay Modgil, Henry Prakken abstract. This chapter reviews abstract rule-based approaches to argumentation, in particular the ASPIC framework. In ASPIC and its This chapter reviews abstract rule-based approaches to argumentation, in particular the ASPIC framework. In ASPIC and its predecessors, going back to the seminal work of John Pollock, arguments can be formed by ...
متن کاملA Structural Benchmark for Logical Argumentation Frameworks
This paper proposes a practically-oriented benchmark suite for computational argumentation. We instantiate abstract argumentation frameworks with existential rules, a language widely used in Semantic Web applications and provide a generator of such instantiated graphs. We analyse performance of argumentation solvers on these benchmarks.
متن کاملRelating Carneades with Abstract Argumentation
Carneades is a recently proposed formalism for structured argumentation with varying proof standards. An open question is its relation with Dung’s seminal abstract approach to argumentation. In this paper the two formalisms are formally related by translating Carneades into ASPIC, another recently proposed formalism for structured argumentation. Since ASPIC is defined to generate Dungstyle abst...
متن کاملLogical limits of abstract argumentation frameworks
Dung’s argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, wrt a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013